Error Exponent Regions for Multi-user Channels
نویسنده
چکیده
To my parents, my brother and my sisters. ii ACKNOWLEDGEMENTS I would like to thank my thesis co-advisors Achilleas Anastasopoulos and S. Sandeep Pradhan. Achilleas is humorous, brilliant, and creative. My thesis was inspired by his one question-what do the error exponents look like in a broadcast channel? After I plotted a few points on a piece of paper at home, I started to realize that there existed a new degree of freedom-a tradeoff among error exponents. I thank him for his valuable questions and suggestions which went into this thesis. I am grateful to Sandeep for introducing me to multiuser information theory. Sandeep has broad knowledge in multiuser channels, distributed source coding, sensor networks, and other subjects important to me. His insight and perspective in these areas provided many valuable suggestions and guided me in the right direction. Furthermore, he was very patient regarding my progress and gave me a lot of encouragement while I experienced difficulty in my research. Thank you, Sandeep. Finally, I would like to thank my parents, my brother and sisters for their love and support. My mother, who raised four children as a single parent twenty years ago, is a brave and strong woman. A thousand thanks for her endless love and understanding.
منابع مشابه
Error Exponent Region for Gaussian Multiple Access Channels and Gaussian Broadcast Channels
Error exponents for single-user additive white Gaussian noise (AWGN) channels provide bounds on the rate of exponential decay of the average probability of error as a function of the block length of the random codebooks. In this paper, we only consider Gallager-type lower bounds of error exponents [1, 2]. For simplicity, we use the term “error exponent” to mean the maximum of random coding expo...
متن کاملError Exponent Region for Gaussian Broadcast Channels
In this work, we introduce the notion of the error exponent region for a multi-user channel. This region specifies the set of error-exponent vectors that are simultaneously achievable by all users in the multi-user channel. This is done by associating different probabilities of error for different users, contrary to the traditional approach where a single probability of system error is consider...
متن کاملThe Reliability Function of Arbitrary Channels With and Without Feedback
The reliability function of arbitrary single-user communication channels is analyzed. A general formula for the partitioning upper bound to the reliability function of channels without feedback is rst established. This bound is indeed a consequence of the recently derived general expression for the Neyman-Pearson type-II error exponent subject to an exponential bound on the type-I error probabi...
متن کاملThe Expected Achievable Distortion of Two-User Decentralized Interference Channels
This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state information at receivers (CSIR) is considered in two scenarios of perfect and imperfect CSIR. In the imperfect CSIR case, we consider a more practical assumption of...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Exact Random Coding Error Exponents for the Two-User Interference Channels
This paper is about exact error exponents for the two-user interference channel under the random coding regime. Specifically, we first analyze the standard random coding ensemble, where the codebooks are comprised of independently and identically distributed (i.i.d.) codewords. For this ensemble, we focus on optimum decoding, which is in contrast to other, heuristic decoding rules that have bee...
متن کامل